Quantum Speedup by Quantum Annealing
نویسندگان
چکیده
منابع مشابه
Quantum speedup by quantum annealing.
We study the glued-trees problem from A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. Spielman, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (ACM, San Diego, CA, 2003), p. 59. in the adiabatic model of quantum computing and provide an annealing schedule to solve an oracular problem exponentially faster than classically possible. The Hamiltonians involve...
متن کاملQuantum speedup in stoquastic adiabatic quantum computation
Quantum computation provides exponential speedup for solving certain mathematical problems against classical computers. Motivated by current rapid experimental progress on quantum computing devices, various models of quantum computation have been investigated to show quantum computational supremacy. At a commercial side, quantum annealing machine realizes the quantum Ising model with a transver...
متن کاملExponential algorithmic speedup by quantum walk Andrew
Andrew M. Childs,1, ∗ Richard Cleve,2, † Enrico Deotto,1, ‡ Edward Farhi,1, § Sam Gutmann,3, ¶ and Daniel A. Spielman4, ∗∗ Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA Department of Computer Science, University of Calgary, Calgary, Alberta, Canada T2N 1N4 Department of Mathematics, Northeastern University, Boston, MA 02115, USA Department of Ma...
متن کاملConductance in quantum wires by three quantum dots arrays
A noninteracting quantum-dot arrays side coupled to a quantum wire is studied. Transport through the quantum wire is investigated by using a noninteracting Anderson tunneling Hamiltonian. The conductance at zero temperature develops an oscillating band with resonances and antiresonances due to constructive and destructive interference in the ballistic channel, respectively. Moreover, we have fo...
متن کاملQuantum annealing
Quantum annealing Quantum annealing (also known as alloy, crystallization or tempering) is analogous to simulated annealing but in substitution of thermal activation by quantum tunneling. The class of algorithmic methods for quantum annealing (dubbed: 'QA'), sometimes referred by the italian school as Quantum Stochastic Optimization ('QSO'), is a promising metaheuristic tool for solving local s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2012
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.109.050501